Proof finding algorithms for implicational logics
Identifieur interne : 00C179 ( Main/Exploration ); précédent : 00C178; suivant : 00C180Proof finding algorithms for implicational logics
Auteurs : M. W. Bunder [Australie]Source :
- Theoretical computer science [ 0304-3975 ] ; 2000.
Descripteurs français
- Pascal (Inist)
English descriptors
- KwdEn :
Abstract
The work in Bunder (Theoret. Comput. Sci. 169 (1996) 3-21) shows that for each one of many implicational logics the set of all lambda terms, that represent proofs in that logic, can be specified. This paper gives, for most of these logics, algorithms which produce, for any given formula, a form of minimal proof within a fixed number of steps or otherwise a guarantee of unprovability. For the remaining logics there are similar algorithms that produce proofs, but not within a fixed number of steps. The new algorithms have been implemented in Oostdijk (Lambda Cal2).
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream PascalFrancis, to step Corpus: 006053
- to stream PascalFrancis, to step Curation: 000117
- to stream PascalFrancis, to step Checkpoint: 005B61
- to stream Main, to step Merge: 00D109
- to stream Main, to step Curation: 00C179
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Proof finding algorithms for implicational logics</title><author><name sortKey="Bunder, M W" sort="Bunder, M W" uniqKey="Bunder M" first="M. W." last="Bunder">M. W. Bunder</name><affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Mathematics Department, University of Wollongong</s1><s2>Wollongong, NSW 2522</s2><s3>AUS</s3><sZ>1 aut.</sZ></inist:fA14><country>Australie</country><wicri:noRegion>Wollongong, NSW 2522</wicri:noRegion></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">INIST</idno><idno type="inist">00-0103711</idno><date when="2000">2000</date><idno type="stanalyst">PASCAL 00-0103711 INIST</idno><idno type="RBID">Pascal:00-0103711</idno><idno type="wicri:Area/PascalFrancis/Corpus">006053</idno><idno type="wicri:Area/PascalFrancis/Curation">000117</idno><idno type="wicri:Area/PascalFrancis/Checkpoint">005B61</idno><idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">005B61</idno><idno type="wicri:doubleKey">0304-3975:2000:Bunder M:proof:finding:algorithms</idno><idno type="wicri:Area/Main/Merge">00D109</idno><idno type="wicri:Area/Main/Curation">00C179</idno><idno type="wicri:Area/Main/Exploration">00C179</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Proof finding algorithms for implicational logics</title><author><name sortKey="Bunder, M W" sort="Bunder, M W" uniqKey="Bunder M" first="M. W." last="Bunder">M. W. Bunder</name><affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Mathematics Department, University of Wollongong</s1><s2>Wollongong, NSW 2522</s2><s3>AUS</s3><sZ>1 aut.</sZ></inist:fA14><country>Australie</country><wicri:noRegion>Wollongong, NSW 2522</wicri:noRegion></affiliation></author></analytic><series><title level="j" type="main">Theoretical computer science</title><title level="j" type="abbreviated">Theor. comput. sci.</title><idno type="ISSN">0304-3975</idno><imprint><date when="2000">2000</date></imprint></series></biblStruct></sourceDesc><seriesStmt><title level="j" type="main">Theoretical computer science</title><title level="j" type="abbreviated">Theor. comput. sci.</title><idno type="ISSN">0304-3975</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Combinatory logic</term><term>Implicational logic</term><term>Intutionistic logic</term><term>Lambda calculus</term><term>Logical programming</term><term>Proof finding</term><term>Type theory</term></keywords><keywords scheme="Pascal" xml:lang="fr"><term>Lambda calcul</term><term>Programmation logique</term><term>Logique combinatoire</term><term>Théorie type</term><term>Logique implication</term><term>Recherche preuve</term><term>Logique intuitioniste</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">The work in Bunder (Theoret. Comput. Sci. 169 (1996) 3-21) shows that for each one of many implicational logics the set of all lambda terms, that represent proofs in that logic, can be specified. This paper gives, for most of these logics, algorithms which produce, for any given formula, a form of minimal proof within a fixed number of steps or otherwise a guarantee of unprovability. For the remaining logics there are similar algorithms that produce proofs, but not within a fixed number of steps. The new algorithms have been implemented in Oostdijk (Lambda Cal2).</div></front></TEI><affiliations><list><country><li>Australie</li></country></list><tree><country name="Australie"><noRegion><name sortKey="Bunder, M W" sort="Bunder, M W" uniqKey="Bunder M" first="M. W." last="Bunder">M. W. Bunder</name></noRegion></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Asie/explor/AustralieFrV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00C179 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 00C179 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Asie
|area= AustralieFrV1
|flux= Main
|étape= Exploration
|type= RBID
|clé= Pascal:00-0103711
|texte= Proof finding algorithms for implicational logics
}}
| This area was generated with Dilib version V0.6.33. |  |